Solving Vehicle Routing Problem with Proposed Non- Dominated Sorting Genetic Algorithm and Comparison with Classical Evolutionary Algorithms

Non-dominated Sorting Genetic Algorithm (NSGA) has established itself as a benchmark algorithm for Multi objective Optimization. The determination of pareto-optimal solutions is the key to its success. However the basic algorithm for big problem gives less efficient results, which renders it less useful for practical applications. Among the variants of NSGA, several attempts have been made to reduce the complexity. Though successful in giving good results but, there is scope for further improvements, especially considering that the populations involved are frequently of large size. We propose a variant which gives better efficient results. The improved algorithm is applied to the transportation problem: vehicle routing problem (VRP). Results of comparative tests are presented showing that the improved algorithm performs well on large populations.